Simultaneous Signaling in Games of Incomplete Demand Information
نویسنده
چکیده
As is well-known from the literature on oligopolistic competition with incomplete information, firms have incentives to share private value demand information. However, by assuming verifiability of demand data, these models ignore the possibility of strategic misinformation. We show that if firms can send misleading demand information, they will always do so. Furthermore, we derive a costly signaling mechanism implementing demand revelation, even without verifiability. For the case of a gamma distribution of the firms’ demand variables, we prove that depending on mean and variance the expected gains from information revelation exceed the expected cost of signaling only if the products are sufficiently differentiated.
منابع مشابه
Dynamic Competitive Supply Chain Network Design with Price Dependent Demand and Huff Utility Function
This paper develops a two-stage model to consider a franchise/franchisee environment in which supply chains are simultaneously entering the untapped market to produce either identical or highly substitutable products and give franchise to franchisees. Customer demand is elastic, price dependent and customer utility function is based on Huff gravity rule model. The supply chains, in the first st...
متن کاملEconomics 703 Advanced Microeconomics Prof. Peter Cramton Lecture Note 3: Mechanism Design Outline A. Introduction to Games with Incomplete Information C. Multilateral Trading Mechanisms 1. Dissolving a Partnership 2. Optimal Auctions A. Introduction to Games with Incomplete Information
A. Introduction to Games with Incomplete Information 1. Imperfect Information vs. Incomplete Information 2. Bayesian Games 3. The Revelation Principle B. Bilateral Trading Mechanisms 1. War of Attrition 2. Simultaneous Offers 3. The Public Choice Problem 4. A General Model 5. Efficiency in Games with Incomplete Information 6. Durability C. Multilateral Trading Mechanisms 1. Dissolving a Partner...
متن کاملA simple and numerically stable primal-dual algorithm for computing Nash-equilibria in sequential games with incomplete information
We present a simple primal-dual algorithm for computing approximate Nash equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold’em poker). Our algorithm only performs basic iterations (i.e matvec multiplications, clipping, etc., and no calls to external first-order oracles, no matrix inversions, etc.) and is applicable to a broad class...
متن کاملAn Experimental Study of Incentive Reversal in Sequential and Simultaneous Games
I t is commonly held that increasing monetary rewards enhance work effort. This study, however, argues that this will not ineludibly occur in team activities. Incentive Reversal may occur in sequential team productions featuring positive external impacts on agents. This seemingly paradoxical event is explained through two experiments in this article. The first experiment involves a sample ...
متن کاملA systematic procedure for nding Perfect Bayesian Equilibria in Incomplete Information Games
This paper provides a non-technical introduction to a procedure to nd Perfect Bayesian equilibria (PBEs) in incomplete information games. Despite the rapidly expanding literature on industrial organization that uses PBE as its main solution concept, most undergraduate and graduate textbooks still present a relatively theoretical introduction to PBEs. This paper o¤ers a systematic ve-step proc...
متن کامل